Effect of initial configuration on network-based recommendation

In this paper, based on a weighted object network, we propose a recommendation algorithm, which is sensitive to the configuration of initial resource distribution. Even under the simplest case with binary resource, the current algorithm has remarkably higher accuracy than the widely applied global ranking method and collaborative filtering. Furthermore, we introduce a free parameter $\beta$ to regulate the initial configuration of resource. The numerical results indicate that decreasing the initial resource located on popular objects can further improve the algorithmic accuracy. More significantly, we argue that a better algorithm should simultaneously have higher accuracy and be more personal. According to a newly proposed measure about the degree of personalization, we demonstrate that a degree-dependent initial configuration can outperform the uniform case for both accuracy and personalization strength.Comment: 4 pages and 3 figure

Emergence of scale-free leadership structure in social recommender systems

The study of the organization of social networks is important for understanding of opinion formation, rumor spreading, and the emergence of trends and fashion. This paper reports empirical analysis of networks extracted from four leading sites with social functionality (Delicious, Flickr, Twitter and YouTube) and shows that they all display a scale-free leadership structure. To reproduce this feature, we propose an adaptive network model driven by social recommending. Artificial agent-based simulations of this model highlight a "good get richer" mechanism where users with broad interests and good judgments are likely to become popular leaders for the others. Simulations also indicate that the studied social recommendation mechanism can gradually improve the user experience by adapting to tastes of its users. Finally we outline implications for real online resource-sharing systems

Time-Sensitive User Profile for Optimizing Search Personlization

International audienceThanks to social Web services, Web search engines have the opportunity to afford personalized search results that better fit the user’s information needs and interests. To achieve this goal, many personalized search approaches explore user’s social Web interactions to extract his preferences and interests, and use them to model his profile. In our approach, the user profile is implicitly represented as a vector of weighted terms which correspond to the user’s interests extracted from his online social activities. As the user interests may change over time, we propose to weight profiles terms not only according to the content of these activities but also by considering the freshness. More precisely, the weights are adjusted with a temporal feature. In order to evaluate our approach, we model the user profile according to data collected from Twitter. Then, we rerank initial search results accurately to the user profile. Moreover, we proved the significance of adding a temporal feature by comparing our method with baselines models that does not consider the user profile dynamics

Mining query structure from click data: a case study of product queries

Most of the information on the Web is inherently structured, product pages of large online shopping sites such as Amazon.com being a typical example. Yet, unstructured keyword queries are still the most common way to search for such structured information, producing an ambiguities and poor ranking, and by that degrading user experience. This problem can be resolved by query segmentation, that is, transformation of unstructured keyword queries into structured queries. The resulting queries can be used to search product databases more accurately, and improve result presentation and query suggestion. The main contribution of our work is a novel approach to query segmentation based on unsupervised machine learning. Its highlight is that query and click-through logs are used for training. Extensive experiments over a large query and click log from a leading shopping engine demonstrate that our approach significantly outperforms baseline